Edizione	[1st ed. 1990.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990
Descrizione fisica	1 online resource (X, 482 p.)
Disciplina	511/.8
Collana	Lecture Notes in Computer Science
Soggetto topico	Computers Electrical engineering Operations research Decision making Algorithms Combinatorics Theory of Computation Electrical Engineering Operations Research/Decision Theory Algorithm Analysis and Problem Complexity Computation by Abstract Devices
ISBN	3-540-47177-4
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Recent progress in string algorithms -- Selection networks -- Computing edge-connectivity in multiple and capacitated graphs -- Efficient sequential and parallel algorithms for planar minimum cost flow -- Structural analyses on the complexity of inverting functions -- Oracles versus proof techniques that do not relativize -- 20-Relative neighborhood graphs are Hamiltonian -- The K-Gabriel graphs and their applications -- Parallel algorithms for generating subsets and set partitions -- Parallel algorithms for linked list and beyond -- Local tournaments and proper circular arc graphs -- Fast algorithms for the dominating set problem on permutation graphs -- Two probabilistic results on merging -- Randomized broadcast in networks -- On the construction of abstract voronoi diagrams, II -- Searching in higher dimension -- Finding extrema with unary predicates -- Implicitly searching convolutions and computing depth of collision -- Characterization for a family of infinitely many irreducible Equally Spaced Polynomials -- Distributed algorithms for deciphering -- An efficient algorithm for optimal loop parallelization (extended abstract) -- Another view on the SSS* algorithm -- Algorithms from complexity theory: Polynomial-time operations for complex sets -- Complexity cores and hard problem instances -- Spatial point location and its applications -- Sublinear merging and natural merge sort -- Constructing strongly convex approximate hulls with inaccurate primitives -- Computing puiseux-series solutions to determinatal equations via combinatorial relaxation -- A tight lower bound on the size of planar permutation networks -- Simultaneous solution of families of problems -- Algorithms for projecting points to give the most uniform distribution with applications to hashing -- Topological sweeping in three dimensions -- Finding least-weight subsequences with fewer processors -- Derandomization by exploiting redundancy and mutual independence -- Planar separators and the Euclidean norm -- On the complexity of isometric embedding in the hypercube -- Distributed function evaluation in the presence of transmission faults -- Optimal linear broadcast -- Graph augmentation problems for a specified set of vertices -- A heuristic algorithm for the k-center problem with vertex weight -- Parallel convexity algorithms for digitized images on a linear array of processors -- Parallel algorithms for labeling image components -- A hyperplane Incidence problem with applications to counting distances -- Splitting a configuration in a simplex -- Weaving patterns of lines and line segments in space -- Efficient parallel algorithms for path problems in planar directed graphs -- Parallel algorithms for finding Steiner forests in planar graphs -- Optimally managing the history of an evolving forest.
Record Nr.	UNISA-996465865803316

Autore	Petreschi Rosella
Edizione	[1st ed. 2003.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003
Descrizione fisica	1 online resource (X, 290 p.)
Disciplina	511/.8
Collana	Lecture Notes in Computer Science
Soggetto topico	Mathematical logic Algorithms Data structures (Computer science) Computers Computer science—Mathematics Computer graphics Mathematical Logic and Foundations Algorithm Analysis and Problem Complexity Data Structures Computation by Abstract Devices Discrete Mathematics in Computer Science Computer Graphics
ISBN	3-540-44849-7
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Tutorials -- Localized Network Representations -- Optimal Binary Search Trees with Costs Depending on the Access Paths -- On the Generation of Extensions of a Partially Ordered Set -- Error-Correcting Codes in Complexity Theory -- Invited Talks -- Cache-Oblivious Algorithms -- Spanning Trees with Low Maximum/Average Stretch -- Hyper Encryption and Everlasting Secrets -- Computing with Electronic Nanotechnologies -- Regular Contribution -- Efficient Update Strategies for Geometric Computing with Uncertainty -- Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete -- An Improved Algorithm for Point Set Pattern Matching under Rigid Motion -- Unlocking the Advantages of Dynamic Service Selection and Pricing -- The Relative Worst Order Ratio for On-Line Algorithms -- On-Line Stream Merging, Max Span, and Min Coverage -- Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs -- Additive Spanners for k-Chordal Graphs -- Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation -- Reconciling Gene Trees to a Species Tree -- Generating All Forest Extensions of a Partially Ordered Set -- Indexing Structures for Approximate String Matching -- Approximation Hardness for Small Occurrence Instances of NP-Hard Problems -- Fast Approximation of Minimum Multicast Congestion — Implementation versus Theory -- Approximation of a Retrieval Problem for Parallel Disks -- On k-Edge-Connectivity Problems with Sharpened Triangle Inequality -- The Complexity of Detecting Fixed-Density Clusters -- Nearly Bounded Error Probabilistic Sets -- Some Properties of MODm Circuits Computing Simple Functions -- XOR-Based Schemes for Fast Parallel IP Lookups -- The Impact of Network Structure on the Stability of Greedy Protocols -- Improving Customer Proximity to Railway Stations -- Differential Approximation for Some Routing Problems.
Record Nr.	UNINA-9910143860003321

Autore	Wilf Herbert S.
Edizione	[2nd ed.]
Pubbl/distr/stampa	Boca Raton, FL : , : Taylor and Francis, an imprint of A K Peters/CRC Press, , 2002
Descrizione fisica	1 online resource (229 p.)
Disciplina	511/.8
Soggetto topico	Problem solving - Data processing Computer algorithms Computational complexity
Soggetto genere / forma	Electronic books.
ISBN	0-429-29492-1 1-56881-574-3 1-4398-6379-2
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Record Nr.	UNINA-9910463721303321

Edizione	[1st ed. 2008.]
Pubbl/distr/stampa	Basel ; ; Boston, : Birkhäuser, c2008
Descrizione fisica	1 online resource (372 p.)
Disciplina	511/.8
Altri autori (Persone)	HoskingR. J VenturinoEzio
Collana	Mathematics and biosciences in interaction
Soggetto topico	System analysis - Simulation methods Science - Mathematical models Economics - Mathematical models Management science - Mathematical models
Soggetto genere / forma	Electronic books.
ISBN	1-281-24211-X 9786611242114 3-7643-8591-X
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Mathematical Models of Pattern Formation in Planktonic Predation-Diffusion Systems: A Review -- Toward a General Theory of Ecosystem Stability: Plankton-Nutrient Interaction as a Paradigm -- Nutrient, Non-toxic Phytoplankton, Toxic Phytoplankton and Zooplankton Interaction in an Open Marine System -- Stability and Optimal Harvesting in a Stage Structure Predator-Prey Switching Strategy -- Insecticidal Bt Crops Under Massive Bt-resistant Pest Invasion: Mathematical Simulation -- Reducing the Emission of Pollutants in Industrial Wastewater through the Use of Membrane Bioreactors -- Model Hysteresis Dimer Molecule. I. Equilibrium Properties -- Model Hysteresis Dimer Molecule. II. Deductions from Probability Profiles -- Mathematical Modelling and Simulation of Coronary Blood Flow -- Modelling Vaccine Protocols -- Modelling the Response of Intracranial Pressure to Microgravity Environments -- “Noisy Oncology”: Some Caveats in using Gaussian Noise in Mathematical Models of Chemotherapy -- Phylogenetic Analysis, Split Systems and Boolean Functions -- Exponential Convergence Analysis of DCNNs having Unbounded Activations and Inhibitory Self-Connections -- The Single-Vendor Multi-Buyer Integrated Inventory Problem: an Heuristic Solution Technique -- A Term Structured Volatility Model of Poll Data and its Application to Election Timing -- Estimation for the Semiparametric Transformation Model under General Censorship -- Integer Programming Models of Bookmobile Routing -- Instability and Sustained Oscillations in Neo-Classical Growth Models with Unemployment -- A Bass-type Model for a Dynamic Market with Logistic Growth -- A Wavelet Neural Network applied to Textile Spinning.
Record Nr.	UNINA-9910451162603321

Autore	Skiena Steven S.
Pubbl/distr/stampa	Cambridge : , : Cambridge University Press, , 2001
Descrizione fisica	1 online resource (xv, 232 pages) : digital, PDF file(s)
Disciplina	511/.8
Collana	Outlooks
Soggetto topico	Mathematical models Gambling - Mathematical models Jai alai - Betting
ISBN	1-107-12372-0 0-521-80426-4 0-511-17476-4 0-511-15479-8 1-280-43341-8 0-511-04396-1 9786610433414 0-511-54708-0 0-511-32344-1
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	The making of a gambler -- What is jai alai? -- Monte Carlo on the tundra -- The impact of the internet -- Is this bum any good? -- Modeling the payoffs -- Engineering the system -- Putting my money where my mouth is -- How should you bet? -- Projects to ponder.
Record Nr.	UNINA-9910450549403321